Legal Assessment Using Conjunctive Queries
نویسندگان
چکیده
Using the Web Ontology Language (OWL) for knowledge representation in the legal domain is very promising but has some limitations. The language is complex thus hard to comprehend, still decidability results in a limited expressiveness which may introduce serious problems in modelling. An aspect of limited expressiveness is the tree-model property of OWL, which can be overcome using rule formalisms or introducing variables, however losing decidability is not always acceptable. We propose using conjunctive queries when modelling conditions of legal norms in the HARNESS architecture. Inference services required for modelling legislation and building legal assessment applications can be feasible using grounded queries resulting in a decidable formalism. Since most of the knowledge base remains within the limits of pure OWL2, we can benefit from consistency checking services of OWL2.
منابع مشابه
Complete Answers to Queries in the Presence of LimitedAccess Patterns ( Extended
We consider the problem of computing the complete answer to a query when there is limited access to relations, i.e., when binding patterns require values to be speciied for certain attributes in order to retrieve data from a relation. This problem is common in information-integration systems , where heterogeneous sources have diverse and limited query capabilities. A query is stable if for any ...
متن کاملOn Answering Queries in the Presence of Limited Access Patterns
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relation in order to retrieve its tuples. In this paper we consider the following fundamental problem: can we compute the complete answer to a query by accessing the relations with legal patterns? The complete answer to a qu...
متن کاملComplete Answers to Queries with Binding Restrictions ( Extended
We consider the problem of computing the complete answer to a query when there is limited access to relations, i.e., when binding patterns require values to be speciied for certain attributes in order to retrieve data from a relation. This problem is common in information-integration systems, where heterogeneous sources have diverse and limited query capabilities. A query is stable if for any i...
متن کاملComputing Complete Answers to Queries with Binding Restrictions
We consider the problem of computing the complete answer to a query when there is limited access to relations, i.e., when binding patterns require values to be specified for certain attributes in order to retrieve data from a relation. This problem is common in information-integration systems, where heterogeneous sources have diverse and limited query capabilities. A query is stable if for any ...
متن کاملOn Answering Queries in the Presence ofLimited
In information-integration systems, source relations often have limitations on access patterns to their data; i.e., when one must provide values for certain attributes of a relation in order to retrieve its tuples. In this paper we consider the following fundamental problem: can we compute the complete answer to a query by accessing the relations with legal patterns? The complete answer to a qu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009